Analysis of top to bottom-k shuffles
نویسندگان
چکیده
منابع مشابه
Analysis of Top to Bottom - K Shuffles 3
A deck of n cards is shuffled by repeatedly moving the top card to one of the bottom kn positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as kn ranges from a constant to n. We also consider a symmetric variant of this shuffle in which at each step either the top card is randomly inserted into the bottom kn positions or a random car...
متن کاملGeneralization of Garsia’s Expansion Formula for Top to Random Shuffles
In the top to random shuffle, the first a cards are removed from a deck of n cards 12 . . . n and then inserted back into the deck. This action can be studied by treating the top to random shuffle as an element Ba of the algebra Q(Sn). For a = 1, Adriano Garsia in “On the Powers of Top to Random Shuffling” (2002) derived an expansion formula for B 1 for k ≤ n, though his proof for the formula w...
متن کاملPerceptual learning: Top to bottom
Perceptual learning has traditionally been portrayed as a bottom-up phenomenon that improves encoding or decoding of the trained stimulus. Cognitive skills such as attention and memory are thought to drive, guide and modulate learning but are, with notable exceptions, not generally considered to undergo changes themselves as a result of training with simple perceptual tasks. Moreover, shifts in...
متن کاملRange Top/Bottom k Queries in OLAP Sparse Data Cubes
A range top k query finds the top k maximum values over all selected cells of an OLAP data cube where the selection is specified by the range of contiguous values for each dimension. In this paper, we propose a partitionbased storage structure, which is capable of answering both range top and bottom k queries in OLAP sparse data cubes. This is achieved by partitioning a multi-dimensional sparse...
متن کاملTop-Down Analysis for Bottom-Up Development
Component-based software engineering (CBSE) is the construction of software systems from software components. Software components are independently deployable units of executable code that can be assembled into a system based on their externally visible properties, which are made available to system developers via the components interface specifications. Software components provide a means for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2006
ISSN: 1050-5164
DOI: 10.1214/10505160500000062